Subdivision Extendibility
نویسندگان
چکیده
Let H be a multigraph and G a graph containing a subgraph isomorphic to a subdivision of H, with S ⊂ V (G) (the ground set) the image of V (H) under the isomorphism. We consider connectivity and minimum degree or degree sum conditions sufficient to imply there is a spanning subgraph of G isomorphic to a subdivision of H on the same ground set. These results generalize a number of theorems in the literature.
منابع مشابه
REVERSE LOOP SUBDIVISION FOR GEOMETRY AND TEXTURES
Reverse subdivision aims at constructing a coarser representation of an object given by a fine polygon mesh. In this paper, we first derive a mask for reverse Loop subdivision that can be applied to both regular and extraordinary vertices. The mask is parameterized, and thus can also be used in reversing variants of Loop subdivision, such as those proposed by Warren and Litke. We apply this mas...
متن کاملInvariance of the barycentric subdivision of a simplicial complex
In this paper we prove that a simplicial complex is determined uniquely up to isomorphism by its barycentric subdivision as well as its comparability graph. We also put together several algebraic, combinatorial and topological invariants of simplicial complexes.
متن کاملTotal Roman domination subdivision number in graphs
A {em Roman dominating function} on a graph $G$ is a function $f:V(G)rightarrow {0,1,2}$ satisfying the condition that every vertex $u$ for which $f(u)=0$ is adjacent to at least one vertex $v$ for which $f(v)=2$. A {em total Roman dominating function} is a Roman dominating function with the additional property that the subgraph of $G$ induced by the set of all vertices of positive weight has n...
متن کاملEternal m-security subdivision numbers in graphs
An eternal $m$-secure set of a graph $G = (V,E)$ is aset $S_0subseteq V$ that can defend against any sequence ofsingle-vertex attacks by means of multiple-guard shifts along theedges of $G$. A suitable placement of the guards is called aneternal $m$-secure set. The eternal $m$-security number$sigma_m(G)$ is the minimum cardinality among all eternal$m$-secure sets in $G$. An edge $uvin E(G)$ is ...
متن کاملOn the extendibility of finitely exchangeable probability measures
We give necessary and sufficient conditions in order that a finite sequence (X1, . . . , Xn) of exchangeable random elements in a fairly general space S be extendible to a longer finite or to an infinite exchangeable sequence. This is done by formulating the extendibility problem as the extension problem for certain bounded linear functionals on suitable normed spaces and by using the Hahn-Bana...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 23 شماره
صفحات -
تاریخ انتشار 2007